Reduced Incidence algebras description of cobweb posets and KoDAGs

نویسنده

  • Ewa Krot-Sieniawska
چکیده

The notion of reduced incidence algebra of an arbitrary cobweb poset is delivered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On incidence algebras description of cobweb posets

Abstract The explicite formulas for Möbius function and some other important elements of the incidence algebra of an arbitrary cobweb poset are delivered. For that to do one uses Kwaśniewski’s construction of his cobweb posets [8, 9]. The digraph representation of these cobweb posets constitutes a newly discovered class of orderable DAG’s [12, 6, 1] named here down KoDAGs with a kind of univers...

متن کامل

Cobweb Posets and KoDAG Digraphs are Representing Natural Join of Relations, their diBigraphs and the Corresponding Adjacency

sponding adjacency matrices is defined and then applied to investigate the so called cobweb posets and their Hasse digraphs called KoDAGs. KoDAGs are special orderable Directed Acyclic Graphs which are cover relation digraphs of cobweb posets introduced by the author few years ago. KoDAGs appear to be distinguished family of Ferrers digraphs which are natural join of a corresponding ordering ch...

متن کامل

Some Cobweb Posets Digraphs’ Elementary Properties and Questions

A digraph that represents reasonably a scheduling problem should have no cycles i.e. it should be DAG i.e. a directed acyclic graph. Here down we shall deal with special kind of graded DAGs named KoDAGs. For their definition and first primary properties see [1], where natural join of di-bigraphs (directed bi-parted graphs) and their corresponding adjacency matrices is defined and then applied t...

متن کامل

Cobweb Posets and KoDAG Digraphs are Representing Natural Join of Relations, their di-Bigraphs

sponding adjacency matrices is defined and then applied to investigate the so called cobweb posets and their Hasse digraphs called KoDAGs. KoDAGs are special orderable Directed Acyclic Graphs which are cover relation digraphs of cobweb posets introduced by the author few years ago. KoDAGs appear to be distinguished family of Ferrers digraphs which are natural join of a corresponding ordering ch...

متن کامل

Characterization of Cobweb Posets as KoDAGs

The characterization of the large family of cobweb posets as DAGs and oDAGs is given. The dim 2 poset such that its Hasse diagram coincide with digraf of arbitrary cobweb poset Π is constructed. AMS Subject Classification: 05C20, 05C75, 06A07, 11B39

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0802.4293  شماره 

صفحات  -

تاریخ انتشار 2008